Obtaining control channel elements of physical downlink control channels for cross-carrier scheduling

ABSTRACT

Methods and apparatus of a NodeB or a user equipment (UE) in communication with each other are provided. The NodeB transmits and the UE receives via a Physical Downlink Control Channel (PDCCH). Control Channel Elements (CCEs) corresponding to a PDCCH candidate are obtained based on nCI, where nCI is a carrier index.

CROSS-REFERENCE TO RELATED APPLICATION(S) AND CLAIM OF PRIORITY

The present application is a continuation of U.S. Non-Provisional patentapplication Ser. No. 13/914,723 filed Jun. 11, 2013 and entitled“OBTAINING CONTROL CHANNEL ELEMENTS OF PHYSICAL DOWNLINK CONTROLCHANNELS FOR CROSS-CARRIER SCHEDULING,” which claims priority to U.S.Provisional Patent Application Ser. No. 61/754,823 filed Jan. 21, 2013,entitled “SEARCH PROCESS FOR PHYSICAL DOWNLINK CONTROL CHANNELS FORCROSS-CARRIER SCHEDULING” and the present application claims priority toU.S. Provisional Patent Application Ser. No. 61/748,694, filed Jan. 3,2013, entitled “SEARCH PROCESS FOR PHYSICAL DOWNLINK CONTROL CHANNELSFOR CROSS-CARRIER SCHEDULING”. The above-identified patent documents arehereby incorporated by reference in their entirety.

TECHNICAL FIELD

The present application relates generally to wireless communicationsystems and, more specifically, to transmission and reception ofphysical downlink control channels.

BACKGROUND

A communication system includes a DownLink (DL) that conveys signalsfrom transmission points such as Base Stations (BSs) or NodeBs to UserEquipments (UEs) and an UpLink (UL) that conveys signals from UEs toreception points such as NodeBs. A UE, also commonly referred to as aterminal or a mobile station, may be fixed or mobile and may be acellular phone, a personal computer device, and the like. A NodeB, whichis generally a fixed station, may also be referred to as an access pointor other equivalent terminology.

DL signals includes data signals, which carry information content,control signals, and Reference Signals (RS), which are also known aspilot signals. A NodeB conveys data information to UEs throughrespective Physical Downlink Shared CHannels (PDSCHs) and controlinformation through respective Physical Downlink Control CHannels(PDCCHs). UL signals also include data signals, control signals and RS.UEs convey data information to NodeBs through respective Physical UplinkShared CHannels (PUSCHs) and control information through respectivePhysical Uplink Control CHannels (PUCCHs). A UE transmitting datainformation may also convey control information through a PUSCH.

SUMMARY

A method of a NodeB in communication with a User Equipment (UE) isprovided. The NodeB transmits control information scheduling datatransmissions to or from UEs via respective Physical Downlink ControlCHannels (PDCCHs). A PDCCH is transmitted in a number of Control ChannelElements (CCEs) in physical resources that are uniquely determined froma PDCCH candidate m for a respective carrier with an n_(CI) index.

A NodeB in communication with a User Equipment (UE) is provided. TheNodeB comprises one or more processors configured to transmit PhysicalDownlink Control CHannels (PDCCHs). A PDCCH is transmitted in a numberof Control Channel Elements (CCEs) in physical resources that areuniquely determined from a PDCCH candidate m for a respective carrierwith an n_(CI) index.

A User Equipment (UE) in communication with a NodeB is provided. The UEcomprises one or more processors configured to receive Physical DownlinkControl CHannel (PDCCHs). A PDCCH is transmitted in a number of ControlChannel Elements (CCEs) in physical resources that are uniquelydetermined from a PDCCH candidate m for a respective carrier with ann_(CI) index.

Before undertaking the DETAILED DESCRIPTION below, it may beadvantageous to set forth definitions of certain words and phrases usedthroughout this patent document: the terms “include” and “comprise,” aswell as derivatives thereof, mean inclusion without limitation; the term“or,” is inclusive, meaning and/or; the phrases “associated with” and“associated therewith,” as well as derivatives thereof, may mean toinclude, be included within, interconnect with, contain, be containedwithin, connect to or with, couple to or with, be communicable with,cooperate with, interleave, juxtapose, be proximate to, be bound to orwith, have, have a property of, or the like; and the term “controller”means any device, system or part thereof that controls at least oneoperation, such a device may be implemented in hardware, firmware orsoftware, or some combination of at least two of the same. It should benoted that the functionality associated with any particular controllermay be centralized or distributed, whether locally or remotely.Definitions for certain words and phrases are provided throughout thispatent document, those of ordinary skill in the art should understandthat in many, if not most instances, such definitions apply to prior, aswell as future uses of such defined words and phrases.

BRIEF DESCRIPTION OF THE DRAWINGS

For a more complete understanding of the present disclosure and itsadvantages, reference is now made to the following description taken inconjunction with the accompanying drawings, in which like referencenumerals represent like parts:

FIG. 1 illustrates a wireless network according to embodiments of thepresent disclosure;

FIG. 2A illustrates a high-level diagram of a wireless transmit pathaccording to embodiments of the present disclosure;

FIG. 2B illustrates a high-level diagram of a wireless receive pathaccording to embodiments of the present disclosure;

FIG. 3 illustrates a user equipment according to embodiments of thepresent disclosure;

FIG. 4 illustrates an encoding process for a DCI format according toembodiments of the present disclosure;

FIG. 5 illustrates a decoding process for a DCI format according toembodiments of the present disclosure;

FIG. 6 illustrates multiplexing of transmissions for PDCCHs and PDSCHsover a DL subframe according to embodiments of the present disclosure;

FIG. 7 illustrates mapping of REGs to REs in a PRB according toembodiments of the present disclosure;

FIG. 8 illustrates an allocation of PDCCH candidates to different activecarriers when respective transmissions are in a same set of PRBsaccording to embodiments of the present disclosure;

FIG. 9 illustrates an allocation of PDCCH candidates to different activecarriers when respective transmissions are in different PDCCH PRB setsaccording to embodiments of the present disclosure;

FIG. 10 illustrates an allocation of DMRS APs to a first PDCCHtransmission providing a scheduling assignment for a first carrier andto a second PDCCH transmission providing a scheduling assignment for asecond carrier according to embodiments of the present disclosure.

DETAILED DESCRIPTION

FIGS. 1 through 10, discussed below, and the various embodiments used todescribe the principles of the present disclosure in this patentdocument are by way of illustration only and should not be construed inany way to limit the scope of the disclosure. Those skilled in the artwill understand that the principles of the present disclosure may beimplemented in any suitably arranged cellular system.

The following documents and standards descriptions are herebyincorporated into the present disclosure as if fully set forth herein:3GPP TS 36.211 v10.1.0, “E-UTRA, Physical channels and modulation” (REF1); 3GPP TS 36.212 v10.1.0, “E-UTRA, Multiplexing and Channel coding”(REF 2); 3GPP TS 36.213 v10.1.0, “E-UTRA, Physical Layer Procedures”(REF 3); and 3GPP TS 36.331 v11.1.0, “E-UTRA, Radio Resource Control(RRC) Protocol Specification.” (REF 4).

FIG. 1 illustrates a wireless network 100 according to one embodiment ofthe present disclosure. The embodiment of wireless network 100illustrated in FIG. 1 is for illustration only. Other embodiments ofwireless network 100 could be used without departing from the scope ofthis disclosure.

The wireless network 100 includes NodeB 101, NodeB 102, and NodeB 103.NodeB 101 communicates with NodeB 102 and NodeB 103. NodeB 101 alsocommunicates with Internet protocol (IP) network 130, such as theInternet, a proprietary IP network, or other data network.

Depending on the network type, other well-known terms may be usedinstead of “NodeB”, such as “transmission point” (TP), “base station”(BS), “access point” (AP), or “eNodeB” (eNB). For the sake ofconvenience, the term NodeB shall be used herein to refer to the networkinfrastructure components that provide wireless access to remoteterminals.

For the sake of convenience, the term “user equipment” or “UE” is usedherein to designate any remote wireless equipment that wirelesslyaccesses a NodeB, whether the UE is a mobile device (e.g., cell phone)or is normally considered a stationary device (e.g., desktop personalcomputer, vending machine, etc.). In other systems, other well-knownterms may be used instead of “user equipment”, such as “mobile station”(MS), “subscriber station” (SS), “remote terminal” (RT), “wirelessterminal” (WT), and the like.

NodeB 102 provides wireless broadband access to network 130 to a firstplurality of user equipments (UEs) within coverage area 120 of NodeB102. The first plurality of UEs includes UE 111, which may be located ina small business; UE 112, which may be located in an enterprise; UE 113,which may be located in a WiFi hotspot; UE 114, which may be located ina first residence; UE 115, which may be located in a second residence;and UE 116, which may be a mobile device, such as a cell phone, awireless laptop, a wireless PDA, or the like. UEs 111-116 may be anywireless communication device, such as, but not limited to, a mobilephone, mobile PDA and any mobile station (MS).

NodeB 103 provides wireless broadband access to a second plurality ofUEs within coverage area 125 of NodeB 103. The second plurality of UEsincludes UE 115 and UE 116. In some embodiments, one or more of NodeBs101-103 can communicate with each other and with UEs 111-116 using LTEor LTE-A techniques including techniques for using control channelelements of PDCCHs as described in embodiments of the presentdisclosure.

Dotted lines show the approximate extents of coverage areas 120 and 125,which are shown as approximately circular for the purposes ofillustration and explanation only. It should be clearly understood thatthe coverage areas associated with base stations, for example, coverageareas 120 and 125, may have other shapes, including irregular shapes,depending upon the configuration of the base stations and variations inthe radio environment associated with natural and man-made obstructions.

Although FIG. 1 depicts one example of a wireless network 100, variouschanges may be made to FIG. 1. For example, another type of datanetwork, such as a wired network, may be substituted for wirelessnetwork 100. In a wired network, network terminals may replace NodeBs101-103 and UEs 111-116. Wired connections may replace the wirelessconnections depicted in FIG. 1.

FIG. 2A is a high-level diagram of a wireless transmit path. FIG. 2B isa high-level diagram of a wireless receive path. In FIGS. 2A and 2B, thetransmit path 200 may be implemented, e.g., in NodeB 102 and the receivepath 250 may be implemented, e.g., in a UE, such as UE 116 of FIG. 1. Itwill be understood, however, that the receive path 250 could beimplemented in a NodeB (e.g., NodeB 102 of FIG. 1) and the transmit path200 could be implemented in a UE. In certain embodiments, transmit path200 and receive path 250 are configured to perform methods for uplinkcontrol channel multiplexing in beamformed cellular systems as describedin embodiments of the present disclosure. Each of the eNBs 101-103 caninclude a processor, or processing circuitry, configured to performmethods for uplink control channel multiplexing in beamformed cellularsystems as described in embodiments of the present disclosure.

Transmit path 200 comprises channel coding and modulation block 205,serial-to-parallel (S-to-P) block 210, Size N Inverse Fast FourierTransform (IFFT) block 215, parallel-to-serial (P-to-S) block 220, addcyclic prefix block 225, and up-converter (UC) 230. Receive path 250comprises down-converter (DC) 255, remove cyclic prefix block 260,serial-to-parallel (S-to-P) block 265, Size N Fast Fourier Transform(FFT) block 270, parallel-to-serial (P-to-S) block 275, and channeldecoding and demodulation block 280.

At least some of the components in FIGS. 2A and 2B may be implemented insoftware while other components may be implemented by configurablehardware (e.g., one or more processors) or a mixture of software andconfigurable hardware. In particular, it is noted that the FFT blocksand the IFFT blocks described in this disclosure document may beimplemented as configurable software algorithms, where the value of SizeN may be modified according to the implementation.

Furthermore, although this disclosure is directed to an embodiment thatimplements the Fast Fourier Transform and the Inverse Fast FourierTransform, this is by way of illustration only and should not beconstrued to limit the scope of the disclosure. It will be appreciatedthat in an alternate embodiment of the disclosure, the Fast FourierTransform functions and the Inverse Fast Fourier Transform functions mayeasily be replaced by Discrete Fourier Transform (DFT) functions andInverse Discrete Fourier Transform (IDFT) functions, respectively. Itwill be appreciated that for DFT and IDFT functions, the value of the Nvariable may be any integer number (i.e., 1, 2, 3, 4, etc.), while forFFT and IFFT functions, the value of the N variable may be any integernumber that is a power of two (i.e., 1, 2, 4, 8, 16, etc.).

In transmit path 200, channel coding and modulation block 205 receives aset of information bits, applies coding (e.g., LDPC coding) andmodulates (e.g., Quadrature Phase Shift Keying (QPSK) or QuadratureAmplitude Modulation (QAM)) the input bits to produce a sequence offrequency-domain modulation symbols. Serial-to-parallel block 210converts (i.e., de-multiplexes) the serial modulated symbols to paralleldata to produce N parallel symbol streams where N is the IFFT/FFT sizeused in NodeB 102 and UE 116. Size N IFFT block 215 then performs anIFFT operation on the N parallel symbol streams to produce time-domainoutput signals. Parallel-to-serial block 220 converts (i.e.,multiplexes) the parallel time-domain output symbols from Size N IFFTblock 215 to produce a serial time-domain signal. Add cyclic prefixblock 225 then inserts a cyclic prefix to the time-domain signal.Finally, up-converter 230 modulates (i.e., up-converts) the output ofadd cyclic prefix block 225 to RF frequency for transmission via awireless channel. The signal may also be filtered at baseband beforeconversion to RF frequency.

The transmitted RF signal arrives at UE 116 after passing through thewireless channel and reverse operations to those at NodeB 102 areperformed. Down-converter 255 down-converts the received signal tobaseband frequency and remove cyclic prefix block 260 removes the cyclicprefix to produce the serial time-domain baseband signal.Serial-to-parallel block 265 converts the time-domain baseband signal toparallel time domain signals. Size N FFT block 270 then performs an FFTalgorithm to produce N parallel frequency-domain signals.Parallel-to-serial block 275 converts the parallel frequency-domainsignals to a sequence of modulated data symbols. Channel decoding anddemodulation block 280 demodulates and then decodes the modulatedsymbols to recover the original input data stream.

Each of NodeBs 101-103 may implement a transmit path that is analogousto transmitting in the downlink to UEs 111-116 and may implement areceive path that is analogous to receiving in the uplink from UEs111-116. Similarly, each one of UEs 111-116 may implement a transmitpath corresponding to the architecture for transmitting in the uplink toNodeBs 101-103 and may implement a receive path corresponding to thearchitecture for receiving in the downlink from NodeBs 101-103. Each ofthe eNBs 101-103 can include processing circuitry configured to allocateresources to one or more UE's 111-116. For example eNB 102 can includeallocator processing circuitry configured to allocate a unique carrierindicator to UE 116.

FIG. 3 illustrates a UE according to embodiments of the presentdisclosure. The embodiment of user equipment, such as UE 116,illustrated in FIG. 3 is for illustration only. Other embodiments of thewireless subscriber station could be used without departing from thescope of this disclosure. Although MS 116 is depicted by way of example,the description of FIG. 3 can apply equally to any of UE 111, UE 112, UE113, UE 114 and UE 115.

UE 116 comprises antenna 305, radio frequency (RF) transceiver 310,transmit (TX) processing circuitry 315, microphone 320, and receive (RX)processing circuitry 325. UE 116 also comprises speaker 330, mainprocessor 340, input/output (I/O) interface (IF) 345, keypad 350,display 355, and memory 360. Memory 360 further comprises basicoperating system (OS) program 361 and a plurality of applications 362.

Radio frequency (RF) transceiver 310 receives from antenna 305 anincoming RF signal transmitted by a NodeB of wireless network 100. Radiofrequency (RF) transceiver 310 down-converts the incoming RF signal toproduce an intermediate frequency (IF) or a baseband signal. The IF orbaseband signal is sent to receiver (RX) processing circuitry 325 thatproduces a processed baseband signal by filtering, decoding, and/ordigitizing the baseband or IF signal. Receiver (RX) processing circuitry325 transmits the processed baseband signal to speaker 330 (i.e., voicedata) or to main processor 340 for further processing (e.g., webbrowsing).

Transmitter (TX) processing circuitry 315 receives analog or digitalvoice data from microphone 320 or other outgoing baseband data (e.g.,web data, e-mail, interactive video game data) from main processor 340.Transmitter (TX) processing circuitry 315 encodes, multiplexes, and/ordigitizes the outgoing baseband data to produce a processed baseband orIF signal. Radio frequency (RF) transceiver 310 receives the outgoingprocessed baseband or IF signal from transmitter (TX) processingcircuitry 315. Radio frequency (RF) transceiver 310 up-converts thebaseband or IF signal to a radio frequency (RF) signal that istransmitted via antenna 305.

In certain embodiments, main processor 340 is a microprocessor ormicrocontroller. Memory 360 is coupled to main processor 340. Accordingto some embodiments of the present disclosure, part of memory 360comprises a random access memory (RAM) and another part of memory 360comprises a Flash memory, which acts as a read-only memory (ROM).

Main processor 340 can be comprised of one or more processors andexecutes basic operating system (OS) program 361 stored in memory 360 inorder to control the overall operation of wireless subscriber station116. In one such operation, main processor 340 controls the reception offorward channel signals and the transmission of reverse channel signalsby radio frequency (RF) transceiver 310, receiver (RX) processingcircuitry 325, and transmitter (TX) processing circuitry 315, inaccordance with well-known principles. Main processor 340 can includeprocessing circuitry configured to allocate one or more resources. Forexample Main processor 340 can include allocator processing circuitryconfigured to allocate a unique carrier indicator and detectorprocessing circuitry configured to detect a PDCCH scheduling a PDSCHreception of a PUSCH transmission in one of the C carriers.

Main processor 340 is capable of executing other processes and programsresident in memory 360, such as operations for uplink control channelmultiplexing in beamformed cellular systems as described in embodimentsof the present disclosure. Main processor 340 can move data into or outof memory 360, as required by an executing process. In some embodiments,the main processor 340 is configured to execute a plurality ofapplications 362, such as applications for MU-MIMO communications,including obtaining control channel elements of PDCCHs. Main processor340 can operate the plurality of applications 362 based on OS program361 or in response to a signal received from BS 102. Main processor 340is also coupled to I/O interface 345. I/O interface 345 providessubscriber station 116 with the ability to connect to other devices suchas laptop computers and handheld computers. I/O interface 345 is thecommunication path between these accessories and main controller 340.

Main processor 340 is also coupled to keypad 350 and display unit 355.The operator of subscriber station 116 uses keypad 350 to enter datainto subscriber station 116. Display 355 may be a liquid crystal displaycapable of rendering text and/or at least limited graphics from websites. Alternate embodiments may use other types of displays.

Downlink Control Information (DCI) serves several purposes and isconveyed through DCI formats in respective PDCCHs. For example, a DCIformat may correspond to a DL Scheduling Assignment (SA) for PDSCHreceptions or to an UL SA for PUSCH transmissions.

FIG. 4 illustrates an encoding process for a DCI format according toembodiments of the present disclosure. The embodiment illustrated inFIG. 4 is for illustration only. Other embodiments of could be usedwithout departing from the scope of this disclosure.

A NodeB, such as NodeB 102, separately codes and transmits each DCIformat in a respective PDCCH. A Radio Network Temporary Identifier(RNTI) for a UE, such as UE 116, for which a DCI format is intended for,masks a Cyclic Redundancy Check (CRC) of a DCI format codeword in orderto enable UE 116 to identify that a particular DCI format is intendedfor UE 116. The CRC of (non-coded) DCI format bits 410 is computed usinga CRC computation operation 420, and the CRC is then masked using anexclusive OR (XOR) operation 430 between CRC and RNTI bits 440. The XORoperation 430 is defined as: XOR(0,0)=0, XOR(0,1)=1, XOR(1,0)=1,XOR(1,1)=0. The masked CRC bits are appended to DCI format informationbits using a CRC append operation 450, channel coding is performed usinga channel coding operation 460 (e.g. an operation using a convolutionalcode), followed by rate matching operation 470 applied to allocatedresources, and finally, an interleaving and a modulation 480 operationare performed, and the output control signal 490 is transmitted. In thepresent example, both a CRC and a RNTI include 16 bits.

FIG. 5 illustrates a decoding process for a DCI format according toembodiments of the present disclosure. The embodiment illustrated inFIG. 5 is for illustration only. Other embodiments of could be usedwithout departing from the scope of this disclosure.

A receiver of a UE, such as UE 116, performs the reverse operations of atransmitter of a NodeB, such as NodeB 102, to determine whether the UEhas a DCI format assignment in a DL subframe. A received control signal510 is demodulated and the resulting bits are de-interleaved atoperation 520, a rate matching applied at a transmitter of NodeB 102 isrestored through operation 530, and data is subsequently decoded atoperation 540. After decoding the data, DCI format information bits 560are obtained after extracting CRC bits 550, which are then de-masked 570by applying the XOR operation with RNTI 580 of UE 116. Finally, UE 116performs a CRC test 590. If the CRC test passes, UE 116 determines thata DCI format corresponding to the received control signal 210 is validand determines parameters for signal reception or signal transmission.If the CRC test does not pass, UE 116 disregards the presumed DCIformat.

Embodiments of the present disclosure assume that Orthogonal FrequencyDivision Multiplexing (OFDM) is used for DL signal transmissions andthat a NodeB multiplexes PDSCHs and PDCCHs in the frequency domain overa DL Transmission Time Interval (TTI) which is referred to as a DLsubframe. The multiplexing unit is a Physical Resource Block (PRB) thatcomprises one Resource Block (RB) in the frequency domain and one DLsubframe in the time domain. A RB includes a number of N_(sc) ^(RB)sub-carriers, or Resource Elements (REs). A DL subframe includes anumber of N_(symb) ^(DL) OFDM symbols.

FIG. 6 illustrates multiplexing of transmissions for PDCCHs and PDSCHsover a DL subframe according to embodiments of the present disclosure.The embodiment illustrated in FIG. 6 is for illustration only. Otherembodiments of could be used without departing from the scope of thisdisclosure.

Transmissions of PDCCHs and PDSCHs start after a legacy control region610, that includes M_(symb) ^(DL) OFDM symbols (M_(symb) ^(DL) OFDM canbe zero) 610, and are over N_(symb) ^(DL)-M_(symb) ^(DL) OFDM symbols ofa DL subframe. PDCCH transmissions can occur in four PRBs, 620, 630,640, and 650, while remaining PRBs 660, 662, 664, 666, 668 can be usedfor PDSCH transmissions. As a PDCCH transmission can require fewer REsthan the number of REs available in a PRB, multiple PDCCHs may bemultiplexed in a same PRB.

Multiplexing PDCCHs is by using different Control Channel Elements(CCEs). A CCE defines a PDCCH resource unit and includes a number ofResource Element Groups (REGs). Each REG includes a number of elements.The elements of REGs can be interleaved and then mapped to respectiveREs in a PRB in a frequency-first manner.

FIG. 7 illustrates mapping of REGs to REs in a PRB according toembodiments of the present disclosure. The embodiment illustrated inFIG. 7 is for illustration only. Other embodiments of could be usedwithout departing from the scope of this disclosure.

There are 16 REGs 710, and each REG includes nine elements 720. Theelements of REGs are interleaved and mapped to REs of a PRB 730. A PRBfurther includes REs used to transmit Reference Signals (RSs) 740 forUEs to obtain respective channel estimates and demodulate controlinformation conveyed by respective PDCCHs. Such RSs are referred to asDeModulation RSs (DMRSs). There can be up to four DMRSs transmitted fromfour respective Antenna Ports (APs) of NodeB 102. The two DMRS REslocated in a same frequency position and in successive OFDM symbols, 742and 744, are multiplexed by applying the Orthogonal Covering Codes(OCCs) of {1, 1} and {1, −1}. Therefore, in REs 742, a first AP of NodeB102 transmits a first DMRS by applying the {1, 1} OCC and a second AP ofNodeB 102 transmits a second DMRS by applying the {1, −1} OCC. Areceiver of UE 116 can obtain a channel estimate from a DMRS AP byremoving a respective OCC at respective REs. A CCE can include fourREGs, such as for example every fourth REG, and a PRB includes fourCCEs.

UE 116 can be configured by NodeB 102 through higher layer signaling,such as Radio Resource Control (RRC) signaling, for multiple sets ofPRBs for PDCCH transmissions. For example, UE 116 can be configured forPDCCH transmissions of a first set of 8 PRBs and a second set of 4 PRBs.A PDCCH transmission occurs in one or more PRBs of a same set of PRBs. APDCCH transmission to UE 116 can be in a single PRB, and it is thenreferred to as localized and if NodeB 102 has accurate information for achannel experienced by UE 116 then Frequency Domain Scheduling (FDS) orbeam-forming can be used. Alternatively, a PDCCH transmission can be inmultiple PRBs and it is then referred to as distributed.

To avoid a PDCCH transmission to a UE that is blocking a PDCCHtransmission to another UE, a location of each PDCCH in a PRB set is notunique. Therefore, UE 116 performs multiple decoding operations withineach configured PRB set to potentially detect PDCCHs in a DL subframe.For a given number of DCI format bits in FIG. 4, a number of CCEs for arespective PDCCH depends on a channel coding rate (Quadrature PhaseShift Keying (QPSK) is assumed as the modulation scheme). NodeB 102 mayuse a lower channel coding rate (i.e., more CCEs) to transmit PDCCHs toUE 116 while experiencing a low DL Signal-to-Interference and NoiseRatio (SINR) as compared to when UE 116 is experiencing a high DL SINR.

For a PDCCH decoding process, UE 116 can determine candidate PDCCHsaccording to a function having UE-common parameters as inputs, such as aDL subframe number or a total number of CCEs in a DL subframe, andUE-specific parameters such as a RNTI. For example, CCEs correspondingto PDCCH candidate m can be obtained as in Equation (1)

-   -   CCEs for PDCCH candidate m in PRB set p:

$\begin{matrix}{{L \cdot \{ {( {Y_{p,k} + \lfloor \frac{m \cdot N_{{CCE},p,k}}{L \cdot M_{p}^{(L)}} \rfloor} )\mspace{14mu}{mod}\mspace{14mu}\lfloor \frac{N_{{CCE},p,k}}{L} \rfloor} \}} + i} & (1)\end{matrix}$In Equation (1), N_(CCE,p,k) is a total number of CCEs in PRB set p andDL subframe k, L is an aggregation level of CCEs, i=0, . . ., L−1, m=0,. . . , M_(p) ^((L))−1, M_(p) ^((L)) is a number of PDCCH candidates foraggregation level L CCEs in PRB set p and └ ┘ is the “floor” functionrounding a number to its lower integer. For example, for a set p of 8PRBs and 4 CCEs per PRB in DL subframe k, N_(CCE,p,k)=32, L∈{1,2,4,8,16}and, for respective value of L, M_(p) ^((L)) ∈{6,6,2,2,0} or M_(p)^((L))∈{0,6,6,2,2} depending on a DCI format UE 116 attempts to detect.Finally, Y_(p,k) randomizes an initial CCE for a first PDCCH candidatein PRB set p for a UE and Y_(p,k)=(A_(p)·Y_(p,k−1))mod D_(p) withY_(p,−1)=RNTI+f₁(p)≠0, A_(p)=39827+f₂(p) and D_(p)=65537+f₃(p) wheref₁(j), f₂(p) and f₃(p) are functions of PRB set p. For example,f₁(0)=f₂(0)=f₃(0)=0, f₁(1)=f₃(1)=0 and f₂(1)=2. Unless otherwisementioned, the RNTI is assumed to be a Cell-RNTI (C-RNTI) assigned to aUE by a base station for PDSCH receptions or PUSCH transmissionsscheduled by respective PDCCHs.

In addition to determining CCEs for PDCCH candidates, for localizedPDCCH transmissions UE 116 needs to also determine a DMRS AP associatedwith a respective PDCCH candidate. In order to allow spatialmultiplexing of PDCCHs to different UEs in a same set of CCEs, differentDMRS APs need to be associated with each such PDCCH transmission. Thisis achieved by deriving the DMRS AP as a function of a RNTI of UE 116.Moreover, as a number of RNTIs can be much larger than a number of DMRSAPs, a DMRS AP can be additionally determined as a function of aninitial CCE for a PDCCH transmission to further increase the flexibilityfor spatial multiplexing. For example, DMRS AP u=0, . . . , U−1, where Uis a total number of DMRS APs, can be determined as in Equation (2):u=n _(CCE,init)mod N _(CCE,k) ^(PRB)+RNTI·modmin (N _(CCE,k) ^(PRB),L)  (2)In Equation (2), mod is the modulo operation, n_(CCE,init) is an initialCCE of a detected PDCCH, N_(CCE,k) ^(PRB) is a total number of CCEs in aPRB in DL subframe k, and L is a CCE aggregation levelof a detectedPDCCH. For example, for n_(CCE,init)=0, N_(CCE,k) ^(PRB)=4, and L=2, UEswith even RNTIs use DMRS AP u=0 while UEs with odd RNTIs use DMRS APu=1.

In order to improve utilization of carriers with small BandWidths (BWs)or facilitate communication over different carrier frequencies, acommunication system can include an aggregation of several carriers.This is referred to as carrier aggregation. For example, one carrier canhave a BW of 10 MHz while another carrier may have a DL BW of 1.4 MHz orone carrier may operate at a frequency of 900 MHz while another carriermay operate at a frequency of 2.6 GHz. Then, as a spectral efficiency ofPDCCH transmissions is typically low in small DL BWs, it can bepreferable to schedule a PDSCH in a carrier with DL BW of 1.4 MHz from acarrier with DL BW of 10 MHz. Also, as a path-loss is larger for highercarrier frequencies and PDCCH typically requires higher detectionreliability than PDSCH and cannot benefit from retransmissions, it canbe preferable to schedule a PDSCH in a 2.6 GHz carrier from a 900 MHzcarrier. A scheduling of PDSCH (or PUSCH) transmissions from one carrierin another carrier is referred to as cross-carrier scheduling.

When NodeB 102 configures cross-carrier scheduling to UE 116, respectiveDCI formats include a Carrier Indicator Field (CIF) having a valuecorresponding to a respective carrier. For example, for a CIF consistingof 3 bits and a UE configured with 5 carriers, respective binary CIFvalues can be ‘000’, ‘001’, ‘010’, ‘011’, and ‘100’ which correspond torespective numeric values n_(CI of) 0, 1, 2, 3, and 4. An approach todetermining a PDCCH candidate for a carrier in case of cross-carrierscheduling is to replace m in Equation (1) with m′=M_(p) ^((L))·n_(CI).However, in case of Equation (1), due to the modulo operation thisresults to CCEs for a PDCCH candidate intended for a first carrieroverlapping with CCEs for a PDCCH candidate intended for a secondcarrier.

If same PRB sets are used for PDCCH transmissions with and withoutcross-carrier scheduling, the likelihood that PDCCH transmissions willoverlap in the former case is increased as a larger number of PDCCHsneed to be accommodated over a same number of CCEs. To alleviate animpact of such collisions, particularly for the larger CCE aggregationlevels, NodeB 102 can apply spatial multiplexing to respective PDCCHtransmissions.

Certain embodiments of the present disclosure define candidate PDCCHs insupport of cross-carrier scheduling. Certain embodiments of the presentdisclosure define a different initial CCE for a first PDCCH candidate toa same UE in different PRB sets. Certain embodiments of the presentdisclosure use spatial multiplexing of PDCCHs to a same UE in support ofcross-carrier scheduling.

Certain embodiments of the present disclosure consider a determinationby UE 116 of PDCCH candidates associated with different carriers when asame PDCCH PRB set is used in a carrier to perform cross-carrierscheduling in C>1 active carriers. UE 116 configured with C>1 activecarriers can determine a search space for candidate PDCCHs according toa same pseudo-random function as in Equation (1) modified to support C>1active carriers as in Equation (3)

CCEs for PDCCH candidate m in PRB set p:

$\begin{matrix}{{L \cdot \{ {( {Y_{p,k} + \lfloor \frac{m \cdot N_{{CCE},p,k}}{L \cdot {\sum\limits_{c = 0}^{C - 1}\; M_{p,c}^{(L)}}} \rfloor} )\mspace{14mu}{mod}\mspace{14mu}\lfloor \frac{N_{{CCE},p,k}}{L} \rfloor} \}} + i} & (3)\end{matrix}$

The parameters in Equation (3) are as defined in Equation (1) with theexception that, for an aggregation level of L CCEs, a total number ofPDCCH candidates

$\sum\limits_{c = 0}^{C - 1}\; M_{p,c}^{(L)}$is considered for all active carriers c=0, . . . , c−1.

For example, a reason for a number of PDCCH candidates for aggregationlevel L CCEs in PRB set p to depend on a carrier intended for arespective DL SA or UL SA is that different carriers can have differentbandwidths and, for a given DCI format, a number of PDCCH candidates foraggregation level L CCEs in PRB set p can depend on a size of a DCIformat which in turn can depend on a respective carrier bandwidth. Forexample, if a PDCCH transmission in a 20 MHz carrier schedules a PDSCHreception if the 20 MHz carrier or in a 1.4 MHz carrier then, for anaggregation level of L=2 CCE, it have can four candidates for schedulingin the 20 MHz carrier and two candidates for scheduling at the 1.4 MHzcarrier. Therefore, in Equation (3), m also depends on the particularcarrier.

Equation (3) represents a general case where, for different carriers, anumber of PDCCH candidates can be different for a same CCE aggregationlevel. Otherwise, if for a same CCE aggregation level, a same number ofPDCCH candidates exists for different carriers (M_(p,c) ^((L))=M_(p)^((L)) for all c=0, . . . , C−1), Equation (3) can be simplified as inEquation (4)

CCEs for PDCCH candidate m in PRB set p:

$\begin{matrix}{{L \cdot \{ {( {Y_{p,k} + \lfloor \frac{m \cdot N_{{CCE},p,k}}{L \cdot C \cdot M_{p}^{(L)}} \rfloor} )\mspace{14mu}{mod}\mspace{14mu}\lfloor \frac{N_{{CCE},p,k}}{L} \rfloor} \}} + i} & (4)\end{matrix}$

In addition to defining a unified search space encompassing C>1 activecarriers, PDCCH candidates for each of the C active carriers need to bedefined. For localized PDCCH, it is desirable that PDCCH candidates aredistributed in as many PRBs in a set as possible in order to maximizeopportunities for a NodeB to perform FDS or beam-forming for a PDCCHtransmission. In order to maintain this property in case ofcross-carrier scheduling, for every CCE aggregation level, adistribution of PDCCH candidates in a unified search space to each ofthe C active carriers needs to follow a pattern that allocates everyC-th PDCCH candidate to a respective active carrier in the order of acarrier index. For example, for C=2 active carriers and) PDCCHcandidates determined as in Equation (4), PDCCH candidates m=0,2,4, . .. ,2M_(p) ^((L))−2 correspond to a first carrier while PDCCH candidatesm=1,3,5, . . . , 2M_(p) ^((L))−1 correspond to a second carrier.

To further illustrate the need for the above allocation pattern, anexample with C=2, Y_(p,k)=0, L=2, M_(p) ^((L))=6, and N_(CCE,p,k)=32 isconsidered for an PDCCH PRB set with 8 PRBs and N_(CCE,k) ^(PRB)=4 (forsimplicity, it is assumed that M_(p,c) ^((L))=M_(p) ^((L))=6 for c=0,1).For localized PDCCH transmissions, an allocation of CCEs to successiverespective PDCCH candidates m=0, . . . , 11 is {(0, 1), (2, 3), (4, 5),(8, 9), (10, 11), (12, 13), (16, 17), (18, 19), (20, 21), (24, 25), (26,27), (28, 29)} and the respective PRBs are {0, 0, 1, 2, 2, 3, 4, 4, 5,6, 6, 7}. If the first 6 PDCCH candidates were allocated to the firstcarrier and the last 6 PDCCH candidates were allocated to the secondcarrier, a consequence would be that PRBs {4, 5, 6, 7} would not haveany PDCCH candidate for the first carrier and PRBs {0, 1, 2, 3} wouldnot have any PDCCH candidate for the second carrier while some PRBs havemultiple (two) PDCCH candidates for a same carrier. This would thenunnecessarily limit FDS and beamforming opportunities for a localizedPDCCH transmission due to a respective limitation of PRBs with arespective PDCCH candidate. Conversely, by alternating an allocation ofPDCCH candidates to the C=2 active carriers, a PDCCH candidate for thefirst carrier exists in PRBs {0, 1, 2, 4, 5, 6} and an PDCCH candidatefor the second carrier exists in PRBs {0, 2, 3, 4, 6, 7}. Therefore, allPDCCH candidates for each carrier are allocated in different PRBs.

FIG. 8 illustrates an allocation of PDCCH candidates to different activecarriers when respective transmissions are in a same set of PRBsaccording to embodiments of the present disclosure. The embodimentillustrated in FIG. 8 is for illustration only. Other embodiments ofcould be used without departing from the scope of this disclosure.

UE 116 has C=2 active carriers and M_(p) ^((L)) PDCCH candidates percarrier for CCE aggregation level L in PDCCH PRB set p. UE 116 computes,according to Equation (4), a number of 2M_(p) ^((L))−1 PDCCH candidatesfor the C=2 active carriers 810 where the even numbered candidatescorrespond to the first carrier 820 and the odd numbered carrierscorrespond to the second carrier 830.

Although the previous example for an alternating association of PDCCHcandidates obtained by Equation (3) or Equation (4) to respectivecarriers considered a respective same number of PDCCH candidates for aCCE aggregation level, it also applies for a different number of PDCCHcandidates for a CCE aggregation level. For example, if for anaggregation level of L=2 CCEs, there are M_(p,0) ^((L))=6 PDCCHcandidates for a first carrier and M_(p,0) ^((L))=4 PDCCH candidates fora second carrier then, for localized PDCCH transmissions, an allocationof CCEs to successive respective PDCCH candidates m=0, . . . ,9 is {(0,1), (2, 3), (6, 7), (8, 9), (12, 13), (16, 17), (18, 19), (23, 23), (24,25), (28, 29)} and the respective PRBs are {0, 0, 1, 2, 3, 4, 4, 5, 6,7}. Then, PRBs for PDCCH candidates to a first carrier are {0, 1, 3, 4,6, 7} and PRBs for PDCCH candidates to a first carrier are {0, 2, 4, 5}.

Considering Equation (3) and the alternating assignment of consecutivecandidates to different carriers as previously described, the abovepartitioning of the PDCCH candidates can be expressed as in Equation(3A)

CCEs for PDCCH candidate m_(n) _(CI) in PRB set p for carrier with indexn_(CI):

$\begin{matrix}{{L \cdot \{ {( {Y_{p,k} + \lfloor \frac{m_{n_{CI}} \cdot N_{{CCE},p,k}}{L \cdot {\max\limits_{n_{CI}}( M_{p,n_{CI}}^{(L)} )}} \rfloor + n_{CI}} )\mspace{14mu}{mod}\mspace{14mu}\lfloor \frac{N_{{CCE},p,k}}{L} \rfloor} \}} + i} & ( {3A} )\end{matrix}$where m_(n) _(CI) =0, . . . , M_(p,n) _(CI) ^((L))−1 is a number ofPDCCH candidates for aggregation level L CCEs in PRB set p and carrierindex n_(CI) and

$\max\limits_{n_{CI}}( M_{p,n_{CI}}^{(L)} )$is the maximum value of M_(p,n) _(CI) ^((L)) across the values ofn_(CI). In the above example,

${\max\limits_{n_{CI}}( M_{p,n_{CI}}^{(L)} )} = {M_{p,0}^{(L)} = 6.}$

A simpler, but less optimal modification to Equation (3) is as inEquation (3B)

-   -   CCEs for PDCCH candidate m_(n) _(CI) in PRB set p for carrier        with index n_(CI):

$\begin{matrix}{{L \cdot \{ {( {Y_{p,k} + \lfloor \frac{m_{n_{CI}} \cdot N_{{CCE},p,k}}{L \cdot M_{p,0}^{(L)}} \rfloor + n_{CI}} )\mspace{14mu}{mod}\mspace{14mu}\lfloor \frac{N_{{CCE},p,k}}{L} \rfloor} \}} + i} & ( {3B} )\end{matrix}$

Considering Equation (4), Equation (3A) can be simplified as in Equation(4A)

-   -   CCEs for PDCCH candidate m (same number of candidates for all        carriers) in PRB set p for carrier with index n_(CI):

$\begin{matrix}{{L \cdot \{ {( {Y_{p,k} + \lfloor \frac{m \cdot N_{{CCE},p,k}}{L \cdot M_{p}^{(L)}} \rfloor + n_{CI}} )\mspace{14mu}{mod}\mspace{14mu}\lfloor \frac{N_{{CCE},p,k}}{L} \rfloor} \}} + i} & ( {4A} )\end{matrix}$

A consequence of a deterministic assignment of PDCCH candidates todifferent carriers when there is no overlapping of respective CCEs amongdifferent PDCCH candidates is that a CIF field in respective DCI formatsis not necessary as based on the location of a PDCCH candidate, UE 116can determine a carrier a PDCCH corresponds to. However, in order toaccount for cases where PDCCH candidates for different carriers sharesame CCEs (this occurs when

$ {N_{{CCE},p,k} < {L \cdot {\sum\limits_{c = 0}^{C - 1}\; M_{p,c}^{(L)}}}} ),$a CIF field can be always present in DCI formats but it can be set to apredetermined value, such as for example a zero value, when

$N_{{CCE},p,k} \geq {L \cdot {\sum\limits_{c = 0}^{C - 1}\;{M_{p,c}^{(L)}.}}}$By using a predetermined value for a CIF field, the CIF field can serveas a virtual CRC to reduce a probability that UE 116 considers a DCIformat intended for another UE, such as UE 115, as intended for theformer UE (i.e., UE 116).

A determination by UE 116 of PDCCH candidates associated with C>1 activecarriers can also be needed when different PDCCH PRB sets are used in acarrier to perform cross-carrier scheduling in each respective activecarrier. For example, UE 116 configured with cross-carrier schedulingand with two PDCCH PRB sets in a first carrier may be indicated, byhigher layer signaling or by specification, to associate a first PDCCHset with a first carrier and a second PDCCH set with a second carrier.The different PDCCH PRB sets can have different sizes as, for example,the C active carriers can have different bandwidths or supportscheduling for different numbers of UEs per subframe. The PDCCHcandidates corresponding to each carrier can be determined for eachrespective PDCCH set as described by Equation (1) with a PDCCH PRB setindex directly associated with a carrier index. As different carrierscan have different number of PDCCH candidates per CCE aggregation levelfor a given DCI format, CCEs corresponding to PDCCH candidate m can beobtained as CCEs for PDCCH candidate m in PRB set

$\begin{matrix}{{p\text{:}\mspace{14mu}{L \cdot \{ {( {Y_{p,k} + \lfloor \frac{m \cdot N_{{CCE},p,k}}{L \cdot M_{p,c}^{(L)}} \rfloor} ){mod}\lfloor \frac{N_{{CCE},p,k}}{L} \rfloor} \}}} + i} & (5)\end{matrix}$where M_(p,c) ^((L)) is a number of PDCCH candidates for aggregationlevel L CCEs in PRB set p for carrier c and the remaining notation issame as for Equation (1).

If the PDCCH sets do not have overlapping PRB pairs, a CIF field doesnot need to be included in a respective DCI format or its value can beset to a predetermined value, such as zero, as it was previouslydescribed. For example, for localized PDCCH candidates in a PRB of aPDCCH PRB set that is not common in another PDCCH PRB set for a same UE,the CIF field can be set to a zero value.

FIG. 9 illustrates an allocation of PDCCH candidates to different activecarriers when respective transmissions are in different PDCCH PRB setsaccording to embodiments of the present disclosure. The embodimentillustrated in FIG. 9 is for illustration only. Other embodiments ofcould be used without departing from the scope of this disclosure.

UE 116 has C=2 active carriers and, for CCE aggregation level L, M_(p)^((L)) PDCCH candidates in PDCCH PRB set p. UE 116 computes, accordingto Equation (1), a number of M₀ ^((L))−1 PDCCH candidates in a firstPDCCH PRB set 910 where all PDCCH candidates are for scheduling in afirst carrier 920 and a same number of M₁ ^((L))−1 PDCCH candidates in asecond PDCCH PRB set 930, which can have a different size than the firstPDCCH PRB set, where all PDCCH candidates are for scheduling in a secondcarrier 940. In case of multiple PDCCH PRB sets per carrier c, a numberof PDCCH candidates in PDCCH PRB set p can be generalized as M_(p,c)^((L)).

Certain embodiments of the present disclosure can support spatialmultiplexing of PDCCH transmissions from a same NodeB for scheduling indifferent carriers.

When a same PDCCH PRB set is used to support cross-carrier scheduling, atotal number of CCEs in the PDCCH PRB set, N_(CCE,p,k) can be smallerthan a total number of CCEs required to support M_(p) ^((L))non-overlapping PDCCH candidates with aggregation level of L CCEs for Ccarriers, i.e. N_(CCE,p,k)<C·L·M_(p) ^((L)). For example, forN_(CCE,p,k)=16, L=4, M_(p) ^((L))=4, and C=2, there can be completeoverlapping of PDCCH candidates for a first carrier with PDCCHcandidates for a second carrier. Similar, for N_(CCE,p,k)=32, L=4, M_(p)^((L))=6, and C=2, there can be 33% overlapping of PDCCH candidates fora first carrier with PDCCH candidates for a second carrier. Increasingthe number of PRBs per PDCCH PRB set or increasing the number of PDCCHPRB sets may not always be possible and it is always associated withadditional overhead and possible bandwidth fragmentation.

For localized PDCCH, the collisions among CCEs corresponding to PDCCHscan be resolved by a NodeB applying orthogonal beamforming to respectivePDCCH transmissions. This is a simple operation and does not rely on anyfeedback from a UE as the PDCCH transmissions are to a same UE from asame NodeB. As overlapping PDCCH transmissions to a same UE need to haveorthogonal beamforming, at least for some or possibly all PDCCHtransmissions a respective optimal beamforming is not used. However,this can be a network implementation issue and can be accommodated byother means such as for example using a somewhat increased transmissionpower, especially when a tradeoff is an increased spectral efficiency(for example, by a factor of 2). Moreover, perfect beamforming for anPDCCH transmission may not always be possible due to CSI measurement orquantization inaccuracies or because a PRB of an PDCCH transmission maynot be one where optimal beamforming can apply.

In order to enable spatial multiplexing of PDCCH transmissions in a samePRB for scheduling in different component carriers, it is necessary toassociate a different DMRS AP for each respective PDCCH transmission.This can be achieved by modifying the DMRS AP determination in Equation(2) to also include a carrier index n_(CI). For example, in case ofcross-carrier scheduling in a same PDCCH PRB set, a DMRS AP u=0, . . . ,U−1, where U is a total number of DMRS APs, for carrier with indexn_(CI) can be determined as in Equation (6)u=n _(CCE,init)modN _(CCE,k) ^(PRB)+(RNTI+n _(CI))·modmin(N _(CCE,k)^(PRB) , L)  (6)In Equation (6), all notations are as in Equation (2) and n_(CI) is acarrier index. For example, for N_(CCE,init)=0, N_(CCE,k) ^(PRB)=4, L=4,and a UE RNTI that is a multiple of four, an PDCCH transmission intendedfor carrier with n_(CI)=0 uses DMRS AP u=0 while an PDCCH transmissionintended for carrier with n_(CI)=1 uses DMRS AP u=1 (instead of u=0 incase a carrier index was not included in a determination of a DMRS AP).

FIG. 10 illustrates an allocation of DMRS APs to a first PDCCHtransmission providing a scheduling assignment for a first carrier andto a second PDCCH transmission providing a scheduling assignment for asecond carrier according to embodiments of the present disclosure. Theembodiment illustrated in FIG. 10 is for illustration only. Otherembodiments of could be used without departing from the scope of thisdisclosure.

A first PDCCH providing a scheduling assignment for a first carrier withindex n_(CI)=0 is transmitted to UE 116 having a RNTI using anaggregation level of L₀ CCEs with an initial CCE having an indexn_(CCE,init,0) in a first PRB having N_(CCE,k) ^(PRB) CCEs and beingincluded in a PDCCH PRB set 1010. A second PDCCH providing a schedulingassignment for a second carrier with index n_(CI)=1 is transmitted to UE116 using an aggregation level of L₁ CCEs with an initial CCE having anindex n_(CCE,init,1) in a second PRB having N_(CCE,k) ^(PRB) CCEs andbeing included in the PDCCH PRB set 1020. For a demodulation of controlinformation in the first PDCCH, UE 116 obtains a channel estimate usinga DMRS AP with index u derived as U=n_(CCE,init,0) mod N_(CCE,k)^(PRB)+RNTI·mod min(N_(CCE,k) ^(PRB),L₀) 1030. For a demodulation ofcontrol information in the second PDCCH, UE 116 obtains a channelestimate using a DMRS AP with index u derived as u=n_(CCE,init,1) modN_(CCE,k) ^(PRB)+(RNTI+1)·mod min(N_(CCE,k) ^(PRB),L₁) 1040.

Certain embodiments of the present disclosure determine a parameterY_(p,k) for a UE that randomizes an initial CCE for a first PDCCHcandidate in PDCCH PRB set p and subframe k.

An objective of having the parameter Y_(p,k) in the determination ofCCEs used by PDCCH candidates as in Equation (1) depend on a PDCCH PRBset index p is to avoid an overlapping of CCEs for PDCCH candidatesbetween two UEs in a first PDCCH PRB set from also occurring in a secondPDCCH PRB set in a same subframe. However, a location of such CCEs alsodepends on the PRB set size as determined by the term

${mod}\lfloor \frac{N_{{CCE},p,k}}{L} \rfloor$in Equation (1). Therefore, if the PDCCH PRB sets have different sizes,resulting to different value of a total number of CCEs N_(CCE,p,k),using a different Y_(p,k) in such respective different sets can actuallybe detrimental in avoiding an overlapping of CCEs for different UE thatoccurs in a first PDCCH PRB set from occurring in a second PDCCH PRB setas due to the different value of

${mod}\lfloor \frac{N_{{CCE},p,k}}{L} \rfloor$in the two PDCCH PRB sets, an overlapping would not occur if Y_(p,k) issame but may occur if Y_(p,k) is additionally changed.

Based on the above, a value of Y_(p,k), in different PDCCH PRB sets in asame subframe k remains same if these sets have different sizes(different numbers of PRBs) and changes only if these sets havedifferent sizes. Therefore, if Y_(0,k) is a value in PDCCH PRB set p=0and Y_(p,k) is a value in PDCCH PRB set p>0 having same size with PDCCHPRB set p=0, Y_(1,k) can be determined in general as in Equation (7)Y _(p,k) =S·Y _(p,k)+(1−S)·Y _(0,k)  (7)where S=1 if ^(N) _(CCE,0,k)=N_(CCE,p,k) and S=0 otherwise(N_(CCE,0,k)≠N_(CCE,p,k)). The condition N_(CCE,0,k)=N_(CCE,p,k) isequivalent to the condition that a number of PRBs in PDCCH PRB set p=0is the same as in PDCCH PRB set p>0.

For Y_(p,k)=(A_(p)·Y_(p,k−1))mod D_(p), if Y_(p,k) is obtained fromY_(0,k) by adding a term to a respective component Q, such as forexample Y_(p,−1)=Y_(0,−1)+f_(Y)(p) or A_(p)=A₀+f_(A)(p) with f_(Y)(p) orf_(A)(p) either having predetermined values or being functions of a setindex p>0, then by denoting the component of Y_(0,k) as Q₀ (e.g.Q₀=Y_(0,−1) or Q₀=A₀) and the component of Y_(p,k) as Q_(p) (e.g.Q_(p)=Y_(p,−1) or Q_(p) =A_(p)), Equation (7) can be expressed asEquation (8)

$\begin{matrix}{Q_{p} = {Q_{0} + {\lfloor \frac{\min( {N_{{CCE},0,k},N_{{CCE},p,k}} )}{\max( {N_{{CCE},0,k},N_{{CCE},p,k}} )} \rfloor \cdot {f_{Q}(p)}}}} & (8)\end{matrix}$

where if PDCCH PRB set p>0 has a same size as PDCCH PRB set p=0,Q_(p)=Q_(c)+f_(Q)(p); otherwise, Q_(p)=Q₀. In case PDCCH PRB set p=0 isindexed so that it always has a larger than or equal size than any otherPDCCH PRB set configured to a UE, Equation (8) can be simplified as

$Q_{p} = {Q_{0} + {\lfloor \frac{N_{{CCE},p,k}}{N_{{CCE},0,k}} \rfloor \cdot {{f_{Q}(p)}.}}}$

Although the present disclosure has been described with an exemplaryembodiment, various changes and modifications may be suggested to oneskilled in the art. It is intended that the present disclosure encompasssuch changes and modifications as fall within the scope of the appendedclaims.

What is claimed is:
 1. A method for a physical downlink control channel(PDCCH) candidate reception in a time unit k, the method comprising:receiving a configuration for a set of C cells, a configuration for aset p of physical resource blocks (PRBs) that includes a total number ofN_(CCE,p,k) control channel elements (CCEs), wherein the PDCCH candidatereception is over an aggregation level of L CCEs from a predeterminedset of aggregation levels of CCEs from the N_(CCE,p,k) CCEs, aconfiguration, per cell from the set of C cells, for a cell indexn_(CI), and a configuration, per cell from the set of C cells, for anumber of M_(p,n) _(CI) ^((L)) PDCCH candidate receptions resulting in aset of numbers of PDCCH candidate receptions for the C cells, whereineach PDCCH candidate reception is over the aggregation level of L CCEs;and determining indices for the number of CCEs of the PDCCH candidatereceptions with the aggregation level of L CCEs as a function of amaximum number of PDCCH candidate receptions with the aggregation levelof L CCEs from the set of numbers of PDCCH candidate receptions with LCCEs for the C cells in the set of p PRBs.
 2. The method of claim 1,wherein the PDCCH candidate reception is on a cell from the set of Ccells with index n_(CI)=0.
 3. The method of claim 2, wherein the indicesfor the number of CCEs of the PDCCH candidate reception are determinedas${{L \cdot \{ {( {Y_{p,k} + \lfloor \frac{m_{n_{CI}} \cdot N_{{CCE},p,k}}{L \cdot {\max\limits_{n_{CI}}( M_{p,n_{CI}}^{(L)} )}} \rfloor + n_{CI}} ){mod}\lfloor \frac{N_{{CCE},p,k}}{L} \rfloor} \}} + i},$wherein: i=0, . . . , L−1, Y_(p,k) is a parameter that ispseudo-randomly varying as a function of time unit k for the set of PRBsp, m_(n) _(CI) is a counter for the PDCCH candidate reception for thecell with index n_(CI) from the number of M_(p,n) _(CI) ^((L)) PDCCHcandidate receptions,$\max\limits_{n_{CI}}( M_{p,n_{CI}}^{(L)} )$  is the maximumnumber of PDCCH candidate receptions from the number of PDCCH candidatereceptions with the aggregation level of L CCEs per cell from the set ofC cells in the set of PRBs p, └ ┘ is the floor function, and “mod” isthe modulo function.
 4. The method of claim 3, further comprising:receiving the configuration for the number of PDCCH candidate receptionsonly for the cell with n_(CI)=0 and is same for every other cell fromthe set of C cells, and determining the indices for the number of CCEsof the PDCCH candidate reception as${L \cdot \{ {( {Y_{p,k} + \lfloor \frac{m_{n_{CI}} \cdot N_{{CCE},p,k}}{L \cdot {\max\limits_{n_{CI}}( M_{p,0}^{(L)} )}} \rfloor + n_{CI}} ){mod}\lfloor \frac{N_{{CCE},p,k}}{L} \rfloor} \}} + {i.}$5. The method of claim 1, wherein a total number of N_(CCE,p,k) ₁ CCEsin PRB set p in a time unit k₁ is different than a total number ofN_(CCE,p,k) ₂ CCEs in PRB set p in a time unit k₂.
 6. The method ofclaim 1, further comprising receiving: a configuration for a second setof PRBs p₂ that includes a second total number of N_(CCE,p) ₂ _(,k)CCEs, wherein the PDCCH candidate reception is over a number of theaggregation level of L CCEs from a predetermined set of numbers of CCEsfrom the N_(CCE,p) ₂ _(,k) CCEs, and a configuration, per cell from theset of C cells, for a second number of M_(p,n) _(CI) _(,2) ^((L)) PDCCHcandidate receptions, wherein each PDCCH candidate reception is over theaggregation level of L CCEs.
 7. The method of claim 1, wherein the PDCCHincludes a downlink control information (DCI) format for scheduling datatransmission or data reception on a cell from the set of C cells,wherein the DCI format for scheduling data transmission or datareception on a cell with index n_(CI) includes a carrier indicator field(CIF) that provides the index n_(CI) when${N_{{CCE},p,k} > {L \cdot {\sum\limits_{c = 0}^{C - 1}M_{p,k}^{(L)}}}},{and}$wherein the DCI format for scheduling data transmission or datareception on a cell with index n_(CI) does not includes the CIF when$N_{{CCE},p,k} < {L \cdot {\sum\limits_{c = 0}^{C - 1}{M_{p,k}^{(L)}.}}}$8. A user equipment (UE), comprising: a receiver for receiving: aconfiguration for a set of C cells, a configuration for a set p ofphysical resource blocks (PRBs) that includes a total number ofN_(CCE,p,k) control channel elements (CCEs), wherein a physical downlinkcontrol channel (PDCCH) candidate reception is over an aggregation levelof L CCEs from a predetermined set of numbers of CCEs from theN_(CCE,p,k) CCEs, a configuration, per cell from the set of C cells, fora cell index n_(CI), and a configuration, per cell from the set of Ccells, for a number of M_(p,n) _(CI) ^((L)) PDCCH candidate receptionsresulting to a set of numbers of PDCCH candidate receptions for the Ccells, wherein each PDCCH candidate reception is over the aggregationlevel of L CCEs; and a processor for determining indices for the numberof CCEs of the PDCCH candidate reception with the aggregation level of LCCEs as a function of a maximum number of PDCCH candidate receptionswith the aggregation level of L CCEs from the set of numbers of PDCCHcandidate receptions with the aggregation level of L CCEs for the Ccells in the set of p PRBs.
 9. The UE of claim 8, wherein the PDCCHcandidate reception is on a cell from the set of C cells with indexn_(CI)=0.
 10. The UE of claim 9, wherein the processor determinesindices for the number of CCEs of the PDCCH candidate reception as${{L \cdot \{ {( {Y_{p,k} + \lfloor \frac{m_{n_{CI}} \cdot N_{{CCE},p,k}}{L \cdot {\max\limits_{n_{CI}}( M_{p,n_{CI}}^{(L)} )}} \rfloor + n_{CI}} ){mod}\lfloor \frac{N_{{CCE},p,k}}{L} \rfloor} \}} + i},$wherein: i=0, . . . , L−1, Y_(p,k) is a parameter that ispseudo-randomly varying as a function of time unit k for the set of PRBsp, m_(n) _(CI) is a counter for the PDCCH candidate reception for thecell with index n_(CI) from the number of M_(p,n) _(CI) ^((L)) PDCCHcandidate receptions,$\max\limits_{n_{CI}}( M_{p,n_{CI}}^{(L)} )$  is the maximumnumber of PDCCH candidate receptions from the number of PDCCH candidatereceptions with the aggregation level of L CCEs per cell from the set ofC cells in the set of PRBs p, └ ┘ is the floor function, and “mod” isthe modulo function.
 11. The UE of claim 10, wherein the receiverreceives the configuration for the number of PDCCH candidate receptionsonly for the cell with n_(CI)=0 and the configuration is the same forevery other cell from the set of C cells, and wherein the processordetermines the indices for the number of CCEs of the PDCCH candidatereception as${L \cdot \{ {( {Y_{p,k} + \lfloor \frac{m_{n_{CI}} \cdot N_{{CCE},p,k}}{L \cdot {\max\limits_{n_{CI}}( M_{p,0}^{(L)} )}} \rfloor + n_{CI}} ){mod}\lfloor \frac{N_{{CCE},p,k}}{L} \rfloor} \}} + {i.}$12. The UE of claim 8, wherein a total number of N_(CCE,p,k) ₁ CCEs inPRB set p in a time unit k₁ is different than a total number ofN_(CCE,p,k) ₂ CCEs in PRB set p in a time unit k₂.
 13. The UE of claim8, wherein the receiver further receives: a configuration for a secondset of PRBs p₂ that includes a second total number of N_(CCE,p) ₂ _(,k)CCEs, wherein the PDCCH candidate reception is over an aggregation levelof L CCEs from a predetermined set of numbers of CCEs from the N_(CCE,p)₂ _(,k) CCEs, and a configuration, per cell from the set of C cells, fora second number of M_(p,n) _(CI) _(,2) ^((L)) PDCCH candidatereceptions, wherein each PDCCH candidate reception is over theaggregation level of L CCEs.
 14. The UE of claim 8, wherein the PDCCHincludes a downlink control information (DCI) format for scheduling datatransmission or data reception on a cell from the set of C cells,wherein the DCI format for scheduling data transmission or datareception on a cell with index n_(CI) includes a carrier indicator field(CIF) that provides the index n_(CI) when${N_{{CCE},p,k} > {L \cdot {\sum\limits_{c = 0}^{C - 1}M_{p,k}^{(L)}}}},{and}$wherein the DCI format for scheduling data transmission or datareception on a cell with index n_(CI) does not includes the CIF when$N_{{CCE},p,k} < {L \cdot {\sum\limits_{c = 0}^{C - 1}{M_{p,k}^{(L)}.}}}$15. A base station, comprising: a transmitter for transmitting: aconfiguration for a set of C cells, a configuration for a set p ofphysical resource blocks (PRBs) that includes a total number ofN_(CCE,p,k) control channel elements (CCEs), wherein a physical downlinkcontrol channel (PDCCH) candidate transmission is over an aggregationlevel of L CCEs from a predetermined set of numbers of CCEs from theN_(CCE,p,k) CCEs, a configuration, per cell from the set of C cells, fora cell index n_(CI), and a configuration, per cell from the set of Ccells, for a number of M_(p,n) _(CI) ^((L)) PDCCH candidatetransmissions resulting to a set of numbers of PDCCH candidatetransmissions for the C cells, wherein each PDCCH candidate transmissionis over the aggregation level of L CCEs; and a processor for determiningindices for the number of CCEs of the PDCCH candidate transmission withthe aggregation level of L CCEs as a function of a maximum number ofPDCCH candidate transmissions with the aggregation level of L CCEs fromthe set of numbers of PDCCH candidate transmissions with the aggregationlevel of L CCEs for the C cells in the set of p PRBs.
 16. The basestation of claim 15, wherein the PDCCH candidate transmission is on acell from the set of C cells with index n_(CI)=0.
 17. The base stationof claim 16, wherein the processor determines indices for the number ofCCEs of the PDCCH candidate transmission as${{L \cdot \{ {( {Y_{p,k} + \lfloor \frac{m_{n_{CI}} \cdot N_{{CCE},p,k}}{L \cdot {\max\limits_{n_{CI}}( M_{p,n_{CI}}^{(L)} )}} \rfloor + n_{CI}} ){mod}\lfloor \frac{N_{{CCE},p,k}}{L} \rfloor} \}} + i},$wherein: i=0, . . . , L−1, Y_(pk) is a parameter that is pseudo-randomlyvarying as a function of time unit k for the set of PRBs p, m_(n) _(CI)is a counter for the PDCCH candidate transmission for the cell withindex n_(CI) from the number of M_(p,n) _(CI) ^((L)) PDCCH candidatetransmissions, $\max\limits_{n_{CI}}( M_{p,n_{CI}}^{(L)} )$ is the maximum number of PDCCH candidate receptions from the number ofPDCCH candidate transmissions with the aggregation level of L CCEs percell from the set of C cells in the set of PRBs p, └ ┘ is the floorfunction, and “mod” is the modulo function.
 18. The base station ofclaim 17, wherein the transmitter transmits the configuration for thenumber of PDCCH candidate transmissions only for the cell with n_(CI)=0and the configuration is the same for every other cell from the set of Ccells, and wherein the processor determines the indices for the numberof CCEs of the PDCCH candidate transmission as${L \cdot \{ {( {Y_{p,k} + \lfloor \frac{m_{n_{CI}} \cdot N_{{CCE},p,k}}{L \cdot {\max\limits_{n_{CI}}( M_{p,0}^{(L)} )}} \rfloor + n_{CI}} ){mod}\lfloor \frac{N_{{CCE},p,k}}{L} \rfloor} \}} + {i.}$19. The base station of claim 15, wherein a total number of N_(CCE,p,k)₁ CCEs in PRB set p in a time unit k₁ is different than a total numberof N_(CCE,p,k) ₂ CCEs in PRB set p in a time unit k₂.
 20. The basestation of claim 15, wherein the transmitter further transmits: aconfiguration for a second set of PRBs p₂ that includes a second totalnumber of N_(CCE,p) ₂ _(,k) CCEs, wherein the PDCCH candidatetransmission is over an aggregation level of L CCEs from a predeterminedset of numbers of CCEs from the N_(CCE,p) ₂ _(,k) CCEs, and aconfiguration, per cell from the set of C cells, for a second number ofM_(p,n) _(CI) _(,2) ^((L)) PDCCH candidate transmissions, wherein eachPDCCH candidate transmission is over the aggregation level of L CCEs.